Zooplankton avoidance of a profiled open-path fluorometer
نویسندگان
چکیده
منابع مشابه
Zooplankton avoidance of a profiled open-path fluorometer
KELLY J. BENOIT-BIRD 1*, MARK A. MOLINE 2, OSCAR M. SCHOFIELD 3, IAN C. ROBBINS 2 AND CHAD M. WALUK 1 1 COLLEGE OF OCEANIC AND ATMOSPHERIC SCIENCES, OREGON STATE UNIVERSITY, 104 COAS ADMINISTRATION BUILDING, CORVALLIS, OR 97331, USA, 2 BIOLOGICAL SCIENCES DEPARTMENT, CENTER FOR MARINE AND COASTAL SCIENCES, CALIFORNIA POLYTECHNIC STATE UNIVERSITY, SAN LUIS OBISPO, CA 93407, USA AND 3 INSTITUTE O...
متن کاملA path planning strategy for obstacle avoidance
This paper presents an obstacle avoidance module dedicated to non-holonomic wheeled mobile robots. Chained system theory and deformable virtual zone principle are coupled to design an original framework based on path following formalism. The proposed strategy allows to correct the control output provided by a navigation module to preserve the robot security while assuring the navigation task. F...
متن کاملPath-Planning Strategies for Ambush Avoidance
by Farmey A. Joseph Submitted to the Department of Aeronautics and Astronautics in partial fulfillment of the requirements for the degree of Master of Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY September 2005 c © Farmey A. Joseph, MMV. All rights reserved. The author hereby grants to MIT permission to reproduce and distribute publicly paper and electronic copies of this thesis documen...
متن کاملPath Planning and Collision Avoidance for Robots
An optimal control problem to find the fastest collision-free trajectory of a robot surrounded by obstacles is presented. The collision avoidance is based on linear programming arguments and expressed as state constraints. The optimal control problem is solved with a sequential programming method. In order to decrease the number of unknowns and constraints a backface culling active set strategy...
متن کاملOn the Path-Avoidance Vertex-Coloring Game
For any graph F and any integer r ≥ 2, the online vertex-Ramsey density of F and r, denoted m∗(F, r), is a parameter defined via a deterministic two-player Ramsey-type game (Painter vs. Builder). This parameter was introduced in a recent paper [arXiv:1103.5849 ], where it was shown that the online vertex-Ramsey density determines the threshold of a similar probabilistic one-player game (Painter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Plankton Research
سال: 2010
ISSN: 0142-7873,1464-3774
DOI: 10.1093/plankt/fbq053